An iterative solution for the optimal poles in a Kautz series
نویسندگان
چکیده
Kautz series allow orthogonal series expansion of finiteenergy signals defined on a semi-infinite axis. The Kautz series consists of orthogonalized exponential functions or sequences. This series has as free parameters an ordered set of poles, each pole associated with an exponential function or sequence. For reasons of approximation and compact representation (coding), an appropriate set of ordered poles is therefore convenient. An iterative procedure to establish the optimal parameters according to an enforced convergence criterion is introduced.
منابع مشابه
An optimal expansion of Volterra models using independent Kautz bases for each kernel dimension
A new solution for the problem of selecting poles of the two-parameter Kautz functions in Volterra models is proposed. In general, a large number of parameters are required to represent the Volterra kernels, although this difficulty can be overcome by describing each kernel using a basis of orthonormal functions, such as the Kautz basis. This representation has a Wiener structure consisting of ...
متن کاملOptimal selection of free parameters in expansions of Volterra models using Kautz functions
A new solution for the problem of selecting poles of the two-parameter Kautz functions in Volterra models of any order is proposed. The usual large number of parameters required to represent the Volterra kernels can be reduced by describing each kernel using a basis of orthonormal functions, such as the Kautz basis. The resulting model can be truncated into fewer terms if the Kautz functions ar...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملIterative algorithm for the generalized $(P,Q)$-reflexive solution of a quaternion matrix equation with $j$-conjugate of the unknowns
In the present paper, we propose an iterative algorithm for solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} {underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$. By this iterative algorithm, the solvability of the problem can be determined automatically. When the matrix equation is consistent over...
متن کاملDynamical Control of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear Equations
One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001